Mathematical problem - PDFSEARCH.IO - Document Search Engine

Mathematical problem
Results: 2693

#	Item
891	Combining Constraint Propagation and Discrete Ellipsoid-Based Search to Solve the Exact Quadratic Knapsack Problem Wen-Yang Ku and J. Christopher Beck Department of Mechanical & Industrial Engineering University of Toron Add to Reading List Source URL: tidel.mie.utoronto.ca Language: English - Date: 2015-01-28 09:11:33 Computational complexity theory Mathematical optimization Constraint programming Quadratic programming Linear programming Semidefinite programming Local consistency Knapsack problem Constraint satisfaction Operations research Theoretical computer science Applied mathematics
892	arXiv:0804.1609v1 [quant-ph] 10 AprThe quantum-to-classical transition: Bohr’s doctrine of classical concepts, emergent classicality, and decoherence Maximilian Schlosshauer a,∗, Kristian Camilleri b Add to Reading List Source URL: arxiv.org Language: English - Date: 2008-04-10 00:23:36 Interpretations of quantum mechanics Philosophy of physics Quantum decoherence Measurement problem Quantum Darwinism Many-worlds interpretation Mathematical formulation of quantum mechanics Copenhagen interpretation Measurement in quantum mechanics Physics Quantum mechanics Quantum measurement
893	AAAI Proceedings Template Add to Reading List Source URL: www.qrg.northwestern.edu Language: English - Date: 2013-10-16 14:55:59 Reasoning Mathematical logic Programming paradigms Problem solving Predicate logic Cyc Logic programming Knowledge representation and reasoning Inference Logic Science Mathematics
894	PUBLICATIONS [1] M. J. Ward, F. M. Odeh, D. S. Cohen, Asymptotic Methods for MOSFET Modeling, NASECODE 5 Conf. Proceed., (1987), pp. 333–M. J. Ward, Multiple Steady State Solutions in a PNPN Structure, NASECOD Add to Reading List Source URL: www.math.ubc.ca Language: English - Date: 2014-07-25 11:50:03 Reaction–diffusion system Mathematics Applied mathematics Science João Arménio Correia Martins Rutherford Aris bibliography Diffusion Mathematical and theoretical biology Narrow escape problem
895	A Tight Lower Bound for the Steiner Point Removal Problem on Trees T.-H. Hubert Chan1, , Donglin Xia2, , Goran Konjevod2, , and Andrea Richa3, 1 Add to Reading List Source URL: i.cs.hku.hk Language: English - Date: 2006-10-19 14:57:44 Distribution Ordinary differential equations Spectral theory Theorems and definitions in linear algebra Orbifold Mathematical analysis Mathematics Tree
896	Problem Solving Methods ___________ Methods Checklist Use to record the range of methods you know, use or/and have experienced. Notice methods that may need development. Solve a problem in several ways using different m Add to Reading List Source URL: schools.reap.org.nz Language: English - Date: 2014-10-23 07:13:20 Education Neuropsychological assessment Problem solving Mathematical problem Problem Theoretical computer science NP-complete How to Solve It Mathematics Mathematics education Educational psychology
897	Simple Rules for Low-Knowledge Algorithm Selection? J. Christopher Beck and Eugene C. Freuder Cork Constraint Computation Centre, Department of Computer Science, University College Cork, Cork, Ireland {c.beck,e.freuder}@ Add to Reading List Source URL: tidel.mie.utoronto.ca Language: English - Date: 2006-01-18 12:07:28 Theoretical computer science Operations research Algorithm Mathematical logic Genetic algorithm Computational complexity theory Online algorithm Travelling salesman problem Ant colony optimization algorithms Mathematics Applied mathematics Mathematical optimization
898	Limitations of Incremental Dynamic Programming Stasys Jukna Abstract We consider so-called “incremental” dynamic programming algorithms, and are interested in the number of subproblems produced by them. The classical Add to Reading List Source URL: lovelace.thi.informatik.uni-frankfurt.de Language: English - Date: 2013-04-23 13:36:27 Operations research Dynamic programming NP-complete problems Mathematical optimization Combinatorics Algorithm Greedy algorithm Knapsack problem Longest increasing subsequence Mathematics Theoretical computer science Applied mathematics
899	Department of Computer Science The Shapley Axiomatization for Values in Partition Function Games Oskar Skibski, University of Warsaw, Poland Tomasz P. Michalak, University of Oxford, UK Add to Reading List Source URL: www.cs.ox.ac.uk Language: English - Date: 2015-03-18 10:54:15 Fair division Shapley value Problem solving Mathematical economics Combinatorics Probability theory Permutation Function Constructible universe Game theory Mathematics Cooperative games
900	Enhancing Davis Putnam with Extended Binary Clause Reasoning Fahiem Bacchus Dept. Of Computer Science University Of Toronto Toronto, Ontario Canada, M5S 1A4 Add to Reading List Source URL: www.cs.toronto.edu Language: English - Date: 2002-04-08 12:32:58 Mathematical logic Constraint programming Formal methods Logic in computer science Boolean algebra Boolean satisfiability problem Unit propagation Resolution Davis–Putnam algorithm Theoretical computer science Mathematics Automated theorem proving

UPDATE